Genetic Algorithms for a Multi-product Dynamic Lot-sizing and Dispatching Problem with Delivery Time Windows and Multi-vehicle Types
نویسندگان
چکیده
منابع مشابه
Three Metaheuristic Algorithms for Solving the Multi-item Capacitated Lot-sizing Problem with Product Returns and Remanufacturing
This paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. The returned products from customers can either be disposed or be remanufactured to be sold as new ones again. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA) al...
متن کاملthree metaheuristic algorithms for solving the multi-item capacitated lot-sizing problem with product returns and remanufacturing
this paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. the returned products from customers can either be disposed or be remanufactured to be sold as new ones again. due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (sa) al...
متن کاملa lagrangean relaxation- genetic algorithm heuristic for multi-product multi-stage and multi-period lot sizing problem with limited resource capacity
in this paper, a hybrid method for limited resource allocation and leveling in complex multi-stage, multi-product and multi-period production planning problems with aim of lot-size determination and total cost minimization has been proposed. this problem consists of multiple products with sequential production processes that are produced in different periods to meet the customers demand. by det...
متن کاملA multi-criteria vehicle routing problem with soft time windows by simulated annealing
This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Korean Institute of Industrial Engineers
سال: 2015
ISSN: 1225-0988
DOI: 10.7232/jkiie.2015.41.3.233